1185B - Email from Polycarp - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define lop(k,n) for(int i=k;i<n;i++)
#define int long long
#define sz(x) long(x.size())
#define te int t;cin>>t;while(t--)
#define el '\n'
#define pi pair<int,int>

void sol(){
string a,b;cin>>a>>b;
int ok=1;
int x=1;
if(a[0]==b[0]){
for (int i=1;i<b.size();i++){
if(b[i]==a[x])x++;
else if(b[i]!=b[i-1])ok=0;
}
}
else ok=0;
if(ok&&x==sz(a))yes;else no;
}
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
te sol();
}